Rate-Memory Trade-off for Multi-Access Coded Caching With Uncoded Placement
نویسندگان
چکیده
منابع مشابه
Uncoded Placement Optimization for Coded Delivery
Existing coded caching schemes fail to simultaneously achieve efficient content placement for non-uniform file popularity and efficient content delivery in the presence of common requests, and hence may not achieve desirable average load under a non-uniform, possibly very skewed, popularity distribution. In addition, existing coded caching schemes usually require the splitting of a file into a ...
متن کاملCoded Caching for Heterogeneous Wireless Networks with Multi-level Access
Content distribution networks, enabled through replicated caching, have enabled broadband content delivery over the wiredInternet. In this paper we propose a wireless content distribution scheme based on a new multi-level storage, access, and distributionarchitecture that is tailored for next generation wireless networks. This scheme significantly outperforms conventional translatio...
متن کاملStructural Properties of Uncoded Placement Optimization for Coded Delivery
A centralized coded caching scheme has been proposed by Maddah-Ali and Niesen to reduce the worst-case load of a network consisting of a server with access to N files and connected through a shared link to K users, each equipped with a cache of size M . However, this centralized coded caching scheme is not able to take advantage of a non-uniform, possibly very skewed, file popularity distributi...
متن کاملImproved rate for a multi-server coded caching
Multi-server coded caching, which can further reduce the amount of transmission by means of the collaboration among these servers in the wireless network during the peak traffic times, can be seen everywhere in our life. This amount is called rate. The three servers setting (two data servers and one parity check server)is widely used in practice, e.g. redundant array of independent disks-4. Luo...
متن کاملCloud Radio Access Networks With Coded Caching
A cloud radio access network (C-RAN) is considered as a candidate to meet the expectations of higher data rate demands in wireless networks. In C-RAN, low energy base stations (BSs) are deployed over a small geography and are allowed to connect to the cloud via finite capacity backhaul links where the information is processed. A conventional C-RAN, however, requires high capacity backhaul links...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2020
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2020.2980817